On the non-Enumerability of l

On structural similarities of finite automata and Turing machine enumerability classes

There are different ways of measuring the complexity of functions that map words to words. Well-known measures are time and space complexity. Enumerability is another possible measure. It is used in recursion theory, where it plays a key rôle in bounded query theory, but also in resource-bounded complexity theory, especially in connection with nonuniform computations. This dissertation transfer...

On Modal Products with the Logic of 'Elsewhere'

The finitely axiomatisable and decidable modal logic Diff of ‘elsewhere’ (or ‘difference operator’) is known to be quite similar to S5. Their validity problems have the same coNP complexity, and their Kripke frames have similar structures: equivalence relations for S5, and ‘almost’ equivalence relations, with the possibility of some irreflexive points, for Diff . However, their behaviour may di...

Enumerability, decidability, computability - an introduction to the theory of recursive functions

Reading a book is also kind of better solution when you have no enough money or time to get your own adventure. This is one of the reasons we show the enumerability decidability computability an introduction to the theory of recursive functions as your friend in spending the time. For more representative collections, this book not only offers it's strategically book resource. It can be a good f...

On the Enumerability of the Determinant and the Rank

Distributional Learning and Context/Substructure Enumerability in Nonlinear Tree Grammars

We study tree-generating almost linear second-order ACGs that admit bounded nonlinearity either on the context side or on the substructure side, and give distributional learning algorithms for them.